Tunnel Parsing with Ambiguous Grammars
نویسندگان
چکیده
Abstract The article proposes an addition to the tunnel parsing algorithm that enables it parse grammars having countable repetitions and configurations of grammar elements generating empty words without refactoring grammar. equivalency trees built by use ambiguous is discussed. class ε-ambiguous defined as a subclass relative these trees. ε-deterministic are then grammars. A technique for linearly on basis non-left recursive with shown.
منابع مشابه
Parallel Parsing of Languages Generated by Ambiguous Bounded Context Grammars
Using the CRCW PRAM model, we describe a language recognition algorithm for an arbitrary grammar in the class of BCPP grammars 9]. (BCPP grammars, which admit ambiguity, are a generalization of both the NTS grammars 14] and Floyd's bounded context (BC) grammars 4].) Using n processors, the algorithm runs in time O(h log n) (O(h) in the case of an unambiguous grammar), where n is the length of t...
متن کاملParsing with Probabilistic Grammars
This paper describes some recent developments in the area of natural language parsing. Probabilistic Grammars are, in principle, grammars enriched with probabilities to distinguish between probable and improbable analyses of a sentence. The first part of the paper introduces the notation of Probabilistic Context-Free Grammars, together with a general algorithm for PCFG top-down parsing and some...
متن کاملEfficient Parsing of Highly Ambiguous Context-Free Grammars with Bit Vectors
An efficient bit-vector-based CKY-style parser for context-free parsing is presented. The parser computes a compact parse forest representation of the complete set of possible analyses for large treebank grammars and long input sentences. The parser uses bit-vector operations to parallelise the basic parsing operations. The parser is particularly useful when all analyses are needed rather than ...
متن کاملParsing with Compositional Vector Grammars
Natural language parsing has typically been done with small sets of discrete categories such as NP and VP, but this representation does not capture the full syntactic nor semantic richness of linguistic phrases, and attempts to improve on this by lexicalizing phrases or splitting categories only partly address the problem at the cost of huge feature spaces and sparseness. Instead, we introduce ...
متن کاملDistributed Parsing With HPSG Grammars
trum f ¨ ur K ¨ unstliche Intelligenz, DFKI) with sites in Kaiserslautern and Saar-brücken is a non-profit organization which was founded in 1988. The share-The DFKI conducts application-oriented basic research in the field of artificial intelligence and other related subfields of computer science. The overall goal is to construct systems with technical knowledge and common sense which-by using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cybernetics and Information Technologies
سال: 2023
ISSN: ['1311-9702', '1314-4081']
DOI: https://doi.org/10.2478/cait-2023-0012